#
# @lc app=leetcode.cn id=1 lang=python3
#
# [1] 两数之和
#

# @lc code=start
from typing import List


class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        n = len(nums)
        for i in range(n):
            for j in range(i + 1, n):
                if (nums[i] + nums[j] == target):
                    return[i, j]
        return []                    

a = Solution()
leng = a.twoSum([1,2,3,4,5,6], 8)
print(leng)             
# @lc code=end

